Toughness and edge-toughness
نویسنده
چکیده
منابع مشابه
[Fracture toughness of zirconia ceramic crowns made by feather-edge tooth preparation design].
BACKGROUND/AIM Fracture toughness determines functional crown strenght and prevents damages on ceramics during mastication. There is a lack of relevant literature data about fracture toughness of crowns made by feather-edge preparation. Mechanical testing of ceramic samples is supposed to show if feather-edge tooth preparation is a successful method for making ceramic crowns without any risk of...
متن کاملOn the higher-order edge toughness of a graph
Chen CC., K.M. Koh and Y.H. Peng, On the higher-order edge toughness of a graph, Discrete Mathematics 111 (1993) 113-123. For an integer c, 1 <c < 1 V(G) I1, we define the cth-order edye toughness of a graph G as The objective of this paper is to study this generalized concept of edge toughness. Besides giving the bounds and relationships of the cth-order edge toughness T,(G) of a graph G, we p...
متن کاملOn the Toughness of Graphs
The toughness of a graph is the graph’s vulnerability to having vertices removed. For example, if vertices of the graph represent homes, and the edge of the graph represent telephone lines connecting them, then the toughness measures how badly telephone communication can broken down by relatively few lightening strikes. In this paper the maximum networks are obtained with prescribed order and t...
متن کاملFiller size of resin-composites, percentage of voids and fracture toughness: is there a correlation?
UNLABELLED The objective of this study was to investigate the correlation between filler size, fracture toughness and voids. Seven model resin composites and one commercial have been used in the study. A single edge notch mould was used to prepare samples (n=8). A selected area of 1mm below and above the notch was scanned with micro CT and then the percentage of voids calculated. A universal te...
متن کاملBounds on the Maximum Number of Edge-disjoint Steiner Trees of a Graph
Tutte and Nash-Williams, independently, gave necessary and sufficient conditions for a connected graph to have at least t edgedisjoint spanning trees. Gusfield introduced the concept of edgetoughness η(G) of a connected graph G, defined as the minimum |S|/(ω(G − S) − 1) taken over all edge-disconnecting sets S of G, where ω(G−S) is the number of connected components of G−S. If a graph has edge-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 164 شماره
صفحات -
تاریخ انتشار 1997